A Multilevel Framework for Lattice Network Coding

نویسندگان

  • Yi Wang
  • Alister G. Burr
  • Qinhui Huang
  • Mehdi M. Molu
چکیده

We present a general framework for studying the multilevel structure of lattice network coding (LNC), whichserves as the theoretical fundamental for solving the ring-based LNC problem in practice, with greatly reduceddecoding complexity. Building on the framework developed, we propose a novel lattice-based network codingsolution, termed layered integer forcing (LIF), which applies to any lattices having multilevel structure. Thetheoretic foundations of the developed multilevel framework lead to a new general lattice construction approach, theelementary divisor construction (EDC), which shows its strength in improving the overall rate over multiple accesschannels (MAC) with low computational cost. We prove that the EDC lattices subsume the traditional complexconstruction approaches. Then a soft detector is developed for lattice network relaying, based on the multilevelstructure of EDC. This makes it possible to employ iterative decoding in lattice network coding, and simulationresults show the large potential of using iterative multistage decoding to approach the capacity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method to Reduce Effects of Packet Loss in Video Streaming Using Multiple Description Coding

Multiple description (MD) coding has evolved as a promising technique for promoting error resiliency of multimedia system in real-time application programs over error-prone communicational channels. Although multiple description lattice vector quantization (MDCLVQ) is an efficient method for transmitting reliable data in the context of potential error channels, this method doesn’t consider disc...

متن کامل

Multilevel Input Ring-Tcm Coding Scheme: a Method for Generating High-Rate Codes

The capability of multilevel input ring-TCM coding scheme for generating high-rate codes with improved symbol Hamming and squared Euclidean distances is demonstrated. The existence of uniform codes and the decoder complexity are also considered.

متن کامل

Robust Distributed Source Coding with Arbitrary Number of Encoders and Practical Code Design Technique

The robustness property can be added to DSC system at the expense of reducing performance, i.e., increasing the sum-rate. The aim of designing robust DSC schemes is to trade off between system robustness and compression efficiency. In this paper, after deriving an inner bound on the rate–distortion region for the quadratic Gaussian MDC based RDSC system with two encoders, the structure of...

متن کامل

Algebraic Approach to Physical-Layer Network Coding

The problem of designing physical-layer network coding (PNC) schemes via nested lattices is considered. Building on the compute-and-forward (C&F) relaying strategy of Nazer and Gastpar, who demonstrated its asymptotic gain using information-theoretic tools, an algebraic approach is taken to show its potential in practical, non-asymptotic, settings. A general framework is developed for studying ...

متن کامل

A Singleton Bound for Lattice Schemes

The binary coding theory and subspace codes for random network coding exhibit similar structures. The method used to obtain a Singleton bound for subspace codes mimic the technique used in obtaining the Singleton bound for binary codes. This motivates the question of whether there is an abstract framework that captures these similarities. As a first step towards answering this question, we use ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1511.03297  شماره 

صفحات  -

تاریخ انتشار 2015